On Stable and Unstable Limit Sets of Finite Families of Cellular Automata
نویسندگان
چکیده
In this paper, we define the notion of limit set for a finite family of cellular automata, which is a generalization of the limit set of a single automaton. We prove that the hierarchy formed by increasing the number of automata in the defining set is infinite, and study the boolean closure properties of different classes of limit sets.
منابع مشابه
Limit Sets of Stable and Unstable Cellular Automata
We construct a cellular automaton (CA) with a sofic and mixing limit set and then construct a stable CA with the same limit set, showing there exist subshifts that can be limit sets of both stable and unstable CAs, answering a question raised by A. Maass.
متن کاملClassification of Sofic Projective Subdynamics of Multidimensional Shifts of Finite Type
Motivated by Hochman’s notion of subdynamics of a Z subshift [8], we define and examine the projective subdynamics of Z shifts of finite type (SFTs) where we restrict not only the action but also the phase space. We show that any Z sofic shift of positive entropy is the projective subdynamics of a Z2 (Z) SFT, and that there is a simple condition characterizing the class of zero-entropy Z sofic ...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملRecursive Cellular Automata Invariant Sets
A bstract. Subshift s of bi-infinit e words give rise to languages in a natural way. Three invariant subshifts associated wit h cellular automata dynamics are considered : the periodic set, non-wandering set , and limit set . Exam ples have been given (see [8,12]) of cellular automata whose invarian t sets give rise to nonrecursive languages. In this pap er , examples are given of cellular aut ...
متن کاملRice's Theorem for μ-Limit Sets of Cellular Automata
Cellular automata are a parallel and synchronous computing model, made of infinitely many finite automata updating according to the same local rule. Rice’s theorem states that any nontrivial property over computable functions is undecidable. It has been adapted by Kari to limit sets of cellular automata [Kar94], that is the set of configurations that can be reached arbitrarily late. This paper ...
متن کامل